A note on isodual constacyclic codes
نویسندگان
چکیده
Article history: Received 13 February 2014 Accepted 18 April 2014 Available online 2 June 2014 Communicated by Gary L. Mullen
منابع مشابه
Constacyclic codes of length $4p^s$ over $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$
Let p be an odd prime, s,m be positive integers and Fpm be the finite field with p m elements. In this paper, we determine all constacyclic codes of length 4p over the finite commutative chain ring R = Fpm + uFpm with unity, where u 2 = 0. We also determine their dual codes and list some isodual constacyclic codes of length 4p over R.
متن کاملIsodual Codes over <Subscript>2<Emphasis Type="Italic">k</Emphasis></Subscript> and Isodual Lattices
A code is called isodual if it is equivalent to its dual code, and a lattice is called isodual if it is isometric to its dual lattice. In this note, we investigate isodual codes over Z2k . These codes give rise to isodual lattices; in particular, we construct a 22-dimensional isodual lattice with minimum norm 3 and kissing number 2464.
متن کاملConstacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملA Note on Hamming distance of constacyclic codes of length $p^s$ over $\mathbb F_{p^m} + u\mathbb F_{p^m}$
For any prime p, λ-constacyclic codes of length p over R = Fpm + uFpm are precisely the ideals of the local ring Rλ = R[x] 〈xp−λ〉 , where u = 0. In this paper, we first investigate the Hamming distances of cyclic codes of length p over R. The minimum Hamming distances of all cyclic codes of length p over R are determined. Moreover, an isometry between cyclic and α-constacyclic codes of length p...
متن کاملA Note on the Weight Distribution of Minimal Constacyclic Codes
In this note we determine weight distributions of minimal constacyclic codes of length p over the finite field Fl, where p is a prime which is coprime to l.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Finite Fields and Their Applications
دوره 29 شماره
صفحات -
تاریخ انتشار 2014